Evolutionary algorithm using surrogate models for solving bilevel multiobjective programming problems
نویسندگان
چکیده
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملSolving Multiobjective Optimization Problems using Evolutionary Algorithm
Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملAn Evolutionary Algorithm for Solving Bilevel Programming Problems Using Duality Conditions
Bilevel programming is characterized by two optimization problems located at different levels, in which the constraint region of the upper level problem is implicitly determined by the lower level problem. This paper is focused on a class of bilevel programmingwith a linear lower level problem and presents a new algorithm for solving this kind of problems by combining an evolutionary algorithm ...
متن کاملAn algorithm for solving a class of bilevel programming problems
We consider the bilevel programming problem with a special lower level. As a reformulation, we use the optimal value approach which will be the basis for an outer approximation. We establish an algorithm that sequentially improves the approximation in order to solve the bilevel programming problem. Convergence results for both local and global optima are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2020
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0243926